Yet Another Pseudorandom Number Generator

نویسندگان

  • Borislav Stoyanov
  • Krzysztof Szczypiorski
  • Krasimir Kordov
چکیده

We propose a novel pseudorandom number generator based on Rössler attractor and bent Boolean function. We estimated the output bits properties by number of statistical tests. The results of the cryptanalysis show that the new pseudorandom number generation scheme provides a high level of data security. Keywords—Rössler attractor, bent Boolean function, pseudorandom number generator.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simple construction of the Pseudorandom Generator from Permutation

A simple construction of pseudorandom generator is appear.This pseudorandom generator is always passed by NIST statistical test.This paper reports a pseudorandom number generator which has good property is able to construct using only permutation and data rewriting by XOR.

متن کامل

Pseudorandom Generators for Read-Once ACC

We consider the problem of constructing pseudorandom generators for read-once circuits. We give an explicit construction of a pseudorandom generator for the class of read-once constant depth circuits with unbounded fan-in AND, OR, NOT and generalized modulo m gates, where m is an arbitrary fixed constant. The seed length of our generator is poly-logarithmic in the number of variables and the er...

متن کامل

Breaking Another Quasigroup-Based Cryptographic Scheme

In their paper “A Quasigroup Based Random Number Generator for Resource Constrained Environments”, the authors Matthew Battey and Abhishek Parakh propose the pseudo random number generator LOQG PRNG 256. We show several highly efficient attacks on LOQG PRNG 256.

متن کامل

A Fast, High Quality, and Reproducible Parallel Lagged-fibonacci Pseudorandom Number Generator

We study the suitability of the additive lagged-Fibonacci pseudorandom number generator for parallel computation. This generator has relatively short period with respect to the size of its seed. However, the short period is more than made up for with the huge number of full-period cycles it contains. These diierent full-period cycles are called equivalence classes. We show how to enumerate the ...

متن کامل

Simple Pseudorandom Number Generator with Strengthened Double Encryption (Cilia)

A new cryptographic pseudorandom number generator Cilia is presented. It hashes real random data using an iterative hash function to update its secret state, and it generates pseudorandom numbers using a block cipher. Cilia is a simple algorithm that uses an improved variant of double encryption with additional security to generate pseudorandom numbers, and its performance is similar to double ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1702.07502  شماره 

صفحات  -

تاریخ انتشار 2017